Understanding Complexity in Multiobjective Optimization
نویسندگان
چکیده
This report documents the program and outcomes of the Dagstuhl Seminar 15031 Understanding Complexity in Multiobjective Optimization. This seminar carried on the series of four previous Dagstuhl Seminars (04461, 06501, 09041 and 12041) that were focused on Multiobjective Optimization, and strengthening the links between the Evolutionary Multiobjective Optimization (EMO) and Multiple Criteria Decision Making (MCDM) communities. The purpose of the seminar was to bring together researchers from the two communities to take part in a wide-ranging discussion about the different sources and impacts of complexity in multiobjective optimization. The outcome was a clarified viewpoint of complexity in the various facets of multiobjective optimization, leading to several research initiatives with innovative approaches for coping with complexity. Seminar January 11–16, 2015 – http://www.dagstuhl.de/15031 1998 ACM Subject Classification G.1.6 Optimization, H.4.2 Types of Systems, I.2.6 Learning, I.2.8 Problem Solving, Control Methods, and Search, I.5.1 Models
منابع مشابه
Satellite Conceptual Design Multi-Objective Optimization Using Co Framework
This paper focuses upon the development of an efficient method for conceptual design optimization of a satellite. There are many option for a satellite subsystems that could be choice, as acceptable solution to implement of a space system mission. Every option should be assessment based on the different criteria such as cost, mass, reliability and technology contraint (complexity). In this rese...
متن کاملA Feature-Based Performance Analysis in Evolutionary Multiobjective Optimization
This paper fundamentally investigates the performance of evolutionary multiobjective optimization (EMO) algorithms for computationally hard 0–1 combinatorial optimization, where a strict theoretical analysis is generally out of reach due to the high complexity of the underlying problem. Based on the examination of problem features from a multiobjective perspective, we improve the understanding ...
متن کاملOutput-sensitive Complexity of Multiobjective Combinatorial Optimization
We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general enumeration problem is regarded efficient if it is output-sensitive, i.e., its running time is bounded by a polynomial in the input and the output size. We provide both practical examples of MOCO problems for which suc...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کامل